0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_ext
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n049.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 06:22:23 CST 2018
0.00/0.20	% done 4 iterations in 0.003s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(satz25b, axiom,
0.00/0.20	  (![Xx:nat,Xy:nat]: (less(Xy,Xx) => lessis(pl(Xy,n_1),Xx)))).
0.00/0.20	tff('0', plain,
0.00/0.20	    ![X0 : nat, X1 : nat]: (lessis(pl(X0, n_1), X1) | ~ less(X0, X1)),
0.00/0.20	    inference('cnf', [status(esa)], [satz25b])).
0.00/0.20	tff(satz25c, conjecture, (lessis(suc(y),x))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture, (~lessis(suc(y),x))).
0.00/0.20	tff('1', plain, ~ lessis(suc(y), x),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff(satz4a, axiom, (![Xx:nat]: (pl(Xx,n_1) = suc(Xx)))).
0.00/0.20	tff('2', plain, ![X2 : nat]: pl(X2, n_1) = suc(X2),
0.00/0.20	    inference('cnf', [status(esa)], [satz4a])).
0.00/0.20	tff('3', plain, ~ lessis(pl(y, n_1), x),
0.00/0.20	    inference('demod', [status(thm)], ['1', '2'])).
0.00/0.20	tff('4', plain, (~ $true | ~ less(y, x)),
0.00/0.20	    inference('sup-', [status(thm)], ['0', '3'])).
0.00/0.20	tff(l, axiom, (less(y,x))).
0.00/0.20	tff('5', plain, less(y, x), inference('cnf', [status(esa)], [l])).
0.00/0.20	tff('6', plain, (~ $true | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['4', '5'])).
0.00/0.20	tff('7', plain, $false, inference('simplify', [status(thm)], ['6'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.20	EOF
